Cycle Traversability for Claw-Free Graphs and Polyhedral Maps
نویسندگان
چکیده
منابع مشابه
Claw-free Graphs VI. Colouring Claw-free Graphs
In this paper we prove that if G is a connected claw-free graph with three pairwise non-adjacent vertices, with chromatic number χ and clique number ω, then χ ≤ 2ω and the same for the complement of G. We also prove that the choice number of G is at most 2ω, except possibly in the case when G can be obtained from a subgraph of the Schläfli graph by replicating vertices. Finally, we show that th...
متن کاملClosure, 2-factors, and cycle coverings in claw-free graphs
In this paper we study cycle coverings and 2-factors of a claw-free graph and those of its closure, which has been de ned by the rst author (On a closure concept in claw-free graphs, J. Combinatorial Theory Ser. B 70 (1997) 217{224). For a claw-free graph G and its closure cl(G), we prove (1) V (G) is covered by k cycles in G if and only if V (cl(G)) is covered by k cycles of cl(G), and (2) G h...
متن کاملLocal connectivity and cycle xtension in claw-free graphs
Let G be a connected claw-free graph, M (G) the set of all vertices of G that have a connected neighborhood, and hM (G)i the induced subgraph of G on M (G). We prove that (i) if M (G) dominates G and hM (G)i is connected, then G is vertex pan-cyclic orderable, (ii) if M (G) dominates G; hM (G)i is connected, and G n M (G) is triangle-free, then G is fully 2-chord extendable, (iii) if M (G) domi...
متن کاملEquimatchable Claw-Free Graphs
A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to the best of our knowledge, the first characterization of claw-free equimatchable graphs by identifying the equimatchable clawfree graph families. This characterization implies an efficient recognition algorithm.
متن کاملMinimal Claw-Free Graphs
A graph G is a minimal claw-free graph (m.c.f. graph) if it contains no K1,3 (claw) as an induced subgraph and if, for each edge e of G, G − e contains an induced claw. We investigate properties of m.c.f. graphs, establish sharp bounds on their orders and the degrees of their vertices, and characterize graphs which have m.c.f. line graphs. MSC 2000: 05C75, 05C07
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2020
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-019-4042-z